Analysis of High Performance Parallel Computing Instruction Sets
نویسندگان
چکیده
منابع مشابه
High-Performance Extendable Instruction Set Computing
111 this paper, a new architecture called the extendable instruction set computer (EISC) is introduced that addresses the issues of memory size and performance in embedded microprocessor systems. The architecture exhibits an efficient fixed length 16-bit instruction set with short length offset and immediate operands. The offset arid imniediate operands can be extended to 32 bits via the operat...
متن کاملHigh Performance Computing: Grid Computing & Parallel Programming
Science is constantly pushing the limits of computational and storage power and even the fastest supercomputers are not capable of satisfying the computational demand. Recent advances in hardware technologies have provided more computing power than ever before and with the advent of multiple core processors we can expect this trend to continue. It is expected that processors with hundreds of co...
متن کاملHigh Performance Parallel Computing with ParaStation3
In the past few years researchers developed new mechanisms and protocols to interact with high speed communication hardware. The technique of user-space communication reduced the overhead caused by the Operating System protocol stacks. Although being successful in terms of achieved performance (latency as well as throughput), the proposed communication models often use nonstandard programming i...
متن کاملImplementation on High Performance Parallel Computing Hardware
Architects and interior designers often want to design a room, and an important part of this design is the lighting. Based on the theory of radiant intensity, the calculation of light energy can be broken down into two parts: configuration factors and enclosures. The configuration factors, which represents the fraction of light leaving one surface and arriving at another are computed using one ...
متن کاملDomain Decomposition Based High Performance Parallel Computing
The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i48/97098